Search results for "Fractional fourier transform"

Localization Operators and an Uncertainty Principle for the Discrete Short Time Fourier Transform

2014

Localization operators in the discrete setting are used to obtain information on a signalffrom the knowledge on the support of its short time Fourier transform. In particular, the extremal functions of the uncertainty principle for the discrete short time Fourier transform are characterized and their connection with functions that generate a time-frequency basis is studied.

An attempt to realise the constrained search approach in the density functional theory

2001

Abstract The problem of reconstruction of wave functions from a given electron density is considered. A reformulation of the problem is proposed which is based on the Fourier transform. Arising mathematical problems are studied, namely, the properties of reduced spatial densities and their Fourier images are obtained, which follow from known properties of the wave functions. The proposed approach may provide a practical implementation of the Constrained Search Approach to the DFT.

Fractional Fourier transform dual random phase encoding of time-varying signals

2008

Optical techniques have shown great potential in the field of information security to encode high-security images. Among several established methods, a double-random phase encryption technique (DRPE) for encoding a primary image into stationary white noise was developed by using the analogy between Fresnel diffraction patterns and the fractional Fourier transform (FrFT-DRPE). In this case, additional keys are obtained through the knowledge of the fractional orders of the FrFTs. In this work we propose an encoding setup for time-varying signals, mainly for short-haul fiber optics link applications, that can be considered as the temporal analogue of the spatial FrFT-DRPE. The behavior of the …

Fast algorithms for free-space diffraction patterns calculation

1999

Here we present a fast algorithm for Fresnel integral calculation. Some fast algorithms using the fast Fourier transform are analysed and their performance has been checked. These methods are of easy implementation, but are only valid for a specific range of distances. Fast algorithms based on the Fractional Fourier transform allow accurate evaluation of the Fresnel integral from object to Fraunhofer domain in a single step.

Fractional Fourier transforms, symmetrical lens systems, and their cardinal planes

2007

We study the relation between optical lens systems that perform a fractional Fourier transform (FRFT) with the geometrical cardinal planes. We demonstrate that lens systems symmetrical with respect to the central plane provide an exact FRFT link between the input and output planes. Moreover, we show that the fractional order of the transform has real values between 0 and 2 when light propagation is produced between principal planes and antiprincipal planes, respectively. Finally, we use this new point of view to design an optical lens system that provides FRFTs with variable fractional order in the range (0,2) without moving the input and output planes.

Fractional wavelet transform

1997

The wavelet transform, which has had a growing importance in signal and image processing, has been generalized by association with both the wavelet transform and the fractional Fourier transform. Possible implementations of the new transformation are in image compression, image transmission, transient signal processing, etc. Computer simulations demonstrate the abilities of the novel transform. Optical implementation of this transform is briefly discussed.

Performance analysis of optical imaging systems based on the fractional fourier transform

1998

Some image quality parameters, such as the Strehl ratio and the optical transfer function, are analysed in the generalized phase-space, or x-p domain, of the fractional Fourier transform associated with a modified one-dimensional pupil function. Some experimental results together with computer simulations are performed which illustrate the tolerance to defocus of different apertures.

Flexible optical implementation of fractional Fourier transform processors. Applications to correlation and filtering

1997

Abstract Recently, in the field of fractional Fourier transforms (FRT) an operation coined “fractional correlation” has been proposed and investigated experimentally. In this paper we propose a new setup for obtaining the fractional correlation, which presents several advantages from the experimental point of view. The fractional filter plane can be adjusted accurately with the help of converging beam illumination and using an adjusting device consisting of a combination of Fresnel zone plates. Moreover the scaling factor between the input pattern and the filter can be adjusted at will. This degree of freedom is of special interest when using SLMs. In addition we present a configuration, ba…

Fractional Fourier Transforms and Geometrical Optics

2010

Discrete wavelet transform implementation in Fourier domain for multidimensional signal

2002

Wavelet transforms are often calculated by using the Mallat algorithm. In this algorithm, a signal is decomposed by a cascade of filtering and downsampling operations. Computing time can be important but the filtering operations can be speeded up by using fast Fourier transform (FFT)-based convolutions. Since it is necessary to work in the Fourier domain when large filters are used, we present some results of Fourier-based optimization of the sampling operations. Acceleration can be obtained by expressing the samplings in the Fourier domain. The general equations of the down- and upsampling of digital multidimensional signals are given. It is shown that for special cases such as the separab…